WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(1, 0)
  "1" :: [] -(0)-> "A"(1, 0)
  "c" :: ["A"(0, 9)] -(9)-> "A"(0, 9)
  "c" :: ["A"(0, 0)] -(0)-> "A"(7, 0)
  "f" :: ["A"(1, 0)] -(1)-> "A"(13, 13)
  "false" :: [] -(0)-> "A"(1, 7)
  "false" :: [] -(0)-> "A"(13, 15)
  "g" :: ["A"(3, 1) x "A"(0, 9)] -(0)-> "A"(0, 7)
  "if" :: ["A"(1, 7) x "A"(0, 15) x "A"(0, 15)] -(1)-> "A"(0, 15)
  "s" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "s" :: ["A"(3, 0)] -(3)-> "A"(3, 1)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 9)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 15)
  "s" :: ["A"(3, 0)] -(3)-> "A"(3, 15)
  "true" :: [] -(0)-> "A"(1, 7)
  "true" :: [] -(0)-> "A"(13, 15)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "1" :: [] -(0)-> "A"_cf(0, 0)
  "c" :: ["A"_cf(0, 2)] -(2)-> "A"_cf(0, 2)
  "c" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "c" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(10, 0)
  "f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "false" :: [] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0) x "A"_cf(0, 2)] -(1)-> "A"_cf(0, 8)
  "g" :: ["A"_cf(0, 2) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 5)
  "if" :: ["A"_cf(0, 0) x "A"_cf(0, 8) x "A"_cf(0, 8)] -(0)-> "A"_cf(0, 8)
  "if" :: ["A"_cf(0, 0) x "A"_cf(0, 9) x "A"_cf(0, 7)] -(0)-> "A"_cf(0, 7)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 2)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 12)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 14)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 7)
  "true" :: [] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1, 0)
  "\"0\"_A" :: [] -(0)-> "A"(0, 1)
  "\"1\"_A" :: [] -(0)-> "A"(1, 0)
  "\"1\"_A" :: [] -(0)-> "A"(0, 1)
  "\"c\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"c\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1)
  "\"false\"_A" :: [] -(0)-> "A"(1, 0)
  "\"false\"_A" :: [] -(0)-> "A"(0, 1)
  "\"s\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"s\"_A" :: ["A"(0, 0)] -(0)-> "A"(0, 1)
  "\"true\"_A" :: [] -(0)-> "A"(1, 0)
  "\"true\"_A" :: [] -(0)-> "A"(0, 1)